翻訳と辞書 Words near each other ・ Parity benchmark ・ Parity bit ・ Parity Committee for the Reconstruction of the Fourth International ・ Parity drive ・ Parity flag ・ Parity function ・ Parity game ・ Parity learning ・ Parity of a permutation ・ Parity of esteem ・ Parity of zero ・ Parity P ・ Parity plot ・ Parity price ・ Parity problem ・ Parity problem (sieve theory) ・ Parity product ・ Parity progression ratios ・ Parity-check matrix ・ Pariu cu viața ・ Pariu-ye Arab ・ Parium ・ Pariva Pranati ・ Parivaar (1987 film) ・ Parivach Zabandi Kayi ・ Parivar Vichora ・ Parivara ・ Parivartan ・ Parivartana ・ Parivartana (1975 film) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Parity problem (sieve theory) ： ウィキペディア英語版 Parity problem (sieve theory) In number theory, the parity problem refers to a limitation in sieve theory that prevents sieves from giving good estimates in many kinds of prime-counting problems. The problem was identified and named by Atle Selberg in 1949. Beginning around 1996, John Friedlander and Henryk Iwaniec developed some parity-sensitive sieves that make the parity problem less of an obstacle. ==Statement== Terence Tao gave this "rough" statement of the problem:〔 〕 This problem is significant because it may explain why it is difficult for sieves to "detect primes," in other words to give a non-trivial lower bound for the number of primes with some property. For example, in a sense Chen's theorem is very close to a solution of the twin prime conjecture, since it says that there are infinitely many primes ''p'' such that prime ''p'' + 2 is either prime or the product of two primes. The parity problem suggests that, because the case of interest has an odd number of prime factors (namely 1), it won't be possible to separate out the two cases using sieves. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Parity problem (sieve theory)」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.